The asymptotic number of integer stochastic matrices
نویسندگان
چکیده
منابع مشابه
On the WZ Factorization of the Real and Integer Matrices
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
متن کاملAsymptotic Nearness of Stochastic and Doubly-Stochastic Matrices
We prove that the set of n×n positive (row-)stochastic matrices and the corresponding set of doubly-stochastic matrices are asymptotically close. More specifically, random matrices within each of these classes are arbitrarily close in sufficiently high dimensions. AMS 2000 subject classifications:Primary 15A51,15A52,15A60, Stochastic Matrices. Let Sn denote the set of n × n stochastic matrices ...
متن کاملAn Asymptotic Formula for the Number of Non-negative Integer Matrices with Prescribed Row and Column Sums
We count m×n non-negative integer matrices (contingency tables) with prescribed row and column sums (margins). For a wide class of smooth margins we establish a computationally efficient asymptotic formula approximating the number of matrices within a relative error which approaches 0 as m and n grow.
متن کاملThe Number of 2× 2 Integer Matrices Having a Prescribed Integer Eigenvalue
Random matrices arise in many mathematical contexts, and it is natural to ask about the properties that such matrices satisfy. If we choose a matrix with integer entries at random, for example, what is the probability that it will have a particular integer as an eigenvalue, or an integer eigenvalue at all? If we choose a matrix with real entries at random, what is the probability that it will h...
متن کاملAsymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes
We prove an asymptotic estimate for the number of m×n non-negative integer matrices (contingency tables) with prescribed row and column sums and, more generally, for the number of integer feasible flows in a network. Similarly, we estimate the volume of the polytope of m × n non-negative real matrices with prescribed row and column sums. Our estimates are solutions of convex optimization proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1971
ISSN: 0012-365X
DOI: 10.1016/0012-365x(71)90007-0